Vertex Set Partitions Preserving Conservativeness
نویسندگان
چکیده
منابع مشابه
Vertex Set Partitions Preserving Conservativeness
Let G be an undirected graph and P=[X1 , ..., Xn] be a partition of V(G). Denote by G P the graph which has vertex set [X1 , ..., Xn], edge set E, and is obtained from G by identifying vertices in each class Xi of the partition P. Given a conservative graph (G, w), we study vertex set partitions preserving conservativeness, i.e., those for which (G P, w) is also a conservative graph. We charact...
متن کاملEnumeration of Trees by Vertex-Set Partitions
Generating functions are given for labeled tree enumeration by the number of edges with a spe-ciic color in a 2-color scheme, or equivalently, the number of vertex-set partitions. Two cases are considered, one with each tree assigned a unit weight and the other with vertex-order weight factors. The procedure followed here is readily generalizable to more than two colors. Tree graphs, noncyclic ...
متن کاملDegree-bounded vertex partitions
This paper studies degree-bounded vertex partitions, considers analogues for wellknown results on the chromatic number and graph perfection, and presents two algorithms for constructing degree-bounded vertex partitions. The first algorithm minimizes the number of partition classes. The second algorithm minimizes a weighted sum of the partition classes where the weight of a partition class depen...
متن کاملCanonical Vertex Partitions
Let σ be a finite relational signature and T a set of finite complete relational structures of signature σ and HT the countable homogeneous relational structure of signature σ which does not embed any of the structures in T . In the case that σ consists of at most binary relations and T is finite the vertex partition behaviour of HT is completely analysed; in the sense that it is shown that a c...
متن کاملCo-2-plex vertex partitions
This paper studies co-k-plex vertex partitions and more specifically co-2-plex vertex partitions. Co-k-plexes and k-plexes were first introduced in 1978 in the context of social network analysis. However, the study of co-k-plex vertex partitions, or the decomposition of graphs into degree bounded subgraphs, dates back at least to the work of Lovasz in 1966. In this paper, we derive analogues fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2000
ISSN: 0095-8956
DOI: 10.1006/jctb.2000.1972